Project-Team:MARELLE

Project-Team Marelle

Members

Overall Objectives

Research Program

Type theory and formalization of mathematics
Verification of scientific algorithms
Programming language semantics

New Software and Platforms

Coq
Easycrypt
Math-Components
Ssreflect
Zoocrypt

New Results

Implementing Theorem Proving in Higher Order Logic Programming
Coqoon: An IDE for interactive proof development in Coq
A book on mathematical components
Proofs of transcendence
Cubical type theory and univalent foundations
Formal study of double-word arithmetic algorithms
Formal foundations of 3D geometry for robot manipulators
Finites sets, finite maps, multisets, order types
CoqEAL and modular large scale reflection
Formalization of semi-algebraic sets
Formalizing the Spectral Theorem
A formal proof of La Salle's invariance principle
Formalizing Delaunay triangulations
Formalizing Quantum Computing
Formalizing De Bruijn Sequences
Formalizing Hanoi towers
Implementation of Bourbaki's Theory of Sets in Coq
Factorization of ordinal numbers
New logics for differential privacy
Formalizing counter-measures for differential power analysis

Partnerships and Cooperations

National Initiatives
International Initiatives
International Research Visitors

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries
Popularization

Bibliography

Major publications
Publications of the year
References in notes

Inria | Raweb 2016 | Presentation of the Project-Team MARELLE | MARELLE Web Site


	PDF	e-Pub

Previous |

Home | Next next

Section: New Results

Formalizing De Bruijn Sequences

Participant : Laurent Théry.

De Bruijn sequences are combinatorial objects. We have shown how they can be generated by exhibiting a link with irreducible polynomials in finite fields, with a formal proof in Coq.

Previous |

Home | Next next